#define _CRT_SECURE_NO_WARNINGS 1
#include<set>
#include<unordered_set>
#include<iostream>
using namespace std;
#include"HashTable.h"
#include"UnorderedMap.h"
#include"UnorderedSet.h"
int main()
{
	/*int a2[] = { 19,30,5,36,13,20,21,12,24,96 };
	hash_bucket::HashTable<int, int> ht2;
	for (auto e : a2)
	{
		ht2.Insert({ e, e });
	}

	ht2.Insert({ 100, 100 });
	ht2.Insert({ 101, 101 });

	cout << ht2.Find(96) << endl;
	cout << ht2.Find(30) << endl;
	cout << ht2.Find(19) << endl << endl;

	ht2.Erase(96);
	ht2.Erase(19);
	ht2.Erase(30);

	cout << ht2.Find(96) << endl;
	cout << ht2.Find(30) << endl;
	cout << ht2.Find(19) << endl<<endl;

	const char* a1[] = { "abcd", "sort", "insert" };
	hash_bucket::HashTable<string, string> ht1;
	for (auto& e : a1)
	{
		ht1.Insert({ e, e });
	}*/

	sty::test_set1();
	sty::test_map1();
	return 0;
}